Stack-based sorting algorithms

The emergence of stacks as a hardware device in stack machines implies the recognition of the importance of using stacks in different computer applications and the need to make use of them in others. This paper uses stacks to solve the sorting problem. Two stack-based sorting algorithms are introduced. The first is based upon sorting by the insertion technique, whereas the second is based upon sorting by the exchange technique. Their analysis and performance are derived when stack computers are used to run them. A comparison study with other sorting algorithms is presented. This study shows that both algorithms have the best performance with a wide margin relative to other sorting algorithms when stack computers are used.